34. Find First and Last Position of Element in Sorted Array - LeetCode Solution


Array Binary Search

Python Code:

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        arr = [-1, -1]


        start =  0
        end = len(nums) -1

        while start<= end:
            mid = (start+end)//2

            if nums[mid] == target:
                end = mid-1
                arr[0] = mid

            elif nums[mid] < target:
                start = mid+1
            else:
                end = mid-1



        start =  0
        end = len(nums) -1

        while start<= end:
            mid = (start+end)//2

            if nums[mid] == target:
                start = mid+1
                arr[1] = mid

            elif nums[mid] < target:
                start = mid+1
            else:
                end = mid-1


        return arr

        


Comments

Submit
0 Comments
More Questions

1660B - Vlad and Candies
1472C - Long Jumps
1293D - Aroma's Search
918A - Eleven
1237A - Balanced Rating Changes
1616A - Integer Diversity
1627B - Not Sitting
1663C - Pōja Verdon
1497A - Meximization
1633B - Minority
688B - Lovely Palindromes
66B - Petya and Countryside
1557B - Moamen and k-subarrays
540A - Combination Lock
1553C - Penalty
1474E - What Is It
1335B - Construct the String
1004B - Sonya and Exhibition
1397A - Juggling Letters
985C - Liebig's Barrels
115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping